Beschreibung zweier verbesserter Repetitions-Goniometers

Two-Pattern Strings — Computing Repetitions & Near-Repetitions

In a recent paper we introduced infinite two-pattern strings on the alphabet {a, b} as a generalization of Sturmian strings, and we posed three questions about them: • Given a finite string x, can we in linear time O(|x|) recognize whether or not x is a prefix/substring of some infinite two-pattern string? • If recognized as two-pattern, can all the repetitions in x be computed in linear time? ...

Zur kategoriellen Beschreibung von Schichtenarchitekturen

Transducers and Repetitions

The factor transducer of a word associates to each of its factors (or subwc~rds) their first occurrence. Optimal bounds on the size of minimal factor transducers together with an algorithm for building them are given. Analogue results and a simple algorithm are given for the case of subsequential suffix transducers. Algorithms are applied to repetition searching in words. Rl~sum~. Le transducte...

Maximal repetitions in strings

The cornerstone of any algorithm computing all repetitions in strings of length n in O(n) time is the fact that the number of maximal repetitions (runs) is linear. Therefore, the most important part of the analysis of the running time of such algorithms is counting the number of runs. Kolpakov and Kucherov [FOCS’99] proved it to be cn but could not provide any value for c. Recently, Rytter [STA...

Ansätze zur Beschreibung der Ästhetik von Interaktion

Neue Technologien eröffnen neue Möglichkeiten in der Interaktionsgestaltung. Die wachsende Zahl theoretisch möglicher Lösungen stellt Gestalter aber auch vor eine neue Verantwortung. Neben der selbstverständlichen Frage der visuellen Ästhetik eines Produkts stellt sich nun auch die Frage nach der Ästhetik von Interaktion. Der vorliegende Beitrag diskutiert bestehende Ansätze und ihr jeweiliges ...